Estimation of the line over-relaxation Factor and Convergence Rates of an Alternating Direction Line Over-Relaxation Technique

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Alternating-Direction Line-Relaxation Methods on Multicomputers

We study the multicomputer performance of a three-dimensional Navier-Stokes solver based on alternating-direction line-relaxation methods. We compare several multicomputer implementations, each of which combines a particular line-relaxation method and a particular distributed block-tridiagonal solver. In our experiments, the problem size was determined by resolution requirements of the applicat...

متن کامل

An Alternating Direction Method for Dual MAP LP Relaxation

Maximum a-posteriori (MAP) estimation is an important task in many applications of probabilistic graphical models. Although finding an exact solution is generally intractable, approximations based on linear programming (LP) relaxation often provide good approximate solutions. In this paper we present an algorithm for solving the LP relaxation optimization problem. In order to overcome the lack ...

متن کامل

Mixed-Model Assembly Line Scheduling Using the Lagrangian Relaxation Technique

The increasing market demand for product variety forces manufacturers to design mixed-model assembly lines on which different product models can be switched back and forth and mixed together with little changeover costs. This paper describes the design and implementation of an optimization-based scheduling algorithm for mixed-model compressor assembly lines of Toshiba with complicated component...

متن کامل

Gauss-Sidel and Successive Over Relaxation Iterative Methods for Solving System of Fuzzy Sylvester Equations

In this paper, we present Gauss-Sidel and successive over relaxation (SOR) iterative methods for finding the approximate solution system of fuzzy Sylvester equations (SFSE), AX + XB = C, where A and B are two m*m crisp matrices, C is an m*m fuzzy matrix and X is an m*m unknown matrix. Finally, the proposed iterative methods are illustrated by solving one example.

متن کامل

Control and Relaxation over the Circle

We formulate and prove a geometric version of the Fundamental Theorem of Algebraic K-Theory which relates the K-theory of the Laurent polynomial extension of a ring to the K-theory of the ring. The geometric version relates the higher simple homotopy theory of the product of a nite complex and a circle with that of the complex. By using methods of controlled topology, we also obtain a geometric...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1965

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/7.4.318